New Decimation-In-Time Fast Hartley Transform Algorithm

Some New Results in Fast Hartley Transform Algorithms - M.S. Thesis

Finding the spectrum of a signal swiftly has been an ever-growing demand in Digital Signal Processing. In quest to meet this stipulation, Discrete Hartley Transform (DHT) is becoming as an encouraging substitute to the more popular discrete Fourier transform. Fast methods to compute the DHT are in existence and are named as fast Hartley transforms (FHTs). In this thesis, a new split-radix FHT a...

Radix-2 Fast Hartley Transform Revisited

A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT). Although fast DHTs are already known, this new approach bring some light about the deep relationship between fast DHT algorithms and a multiplication-free fast algorithm for the Hadamard Transform. Key-words Discrete transforms, Hartley transform, Hadamard Transform.

Arbitrary-length Fast Hartley Transform without Multiplications

Discrete Hartley transform (DHT) is an important tool in digital signal processing. In this paper, a multilierless algorithm to compute discrete Hartley transforms is proposed, which can deal with arbitrary length input signals. The proposed algorithm can be implemented by integer additions of fixed points in binary system. Besides, an efficient and regular systolic array is designed to impleme...

A novel scaling scheme for fast Hartley transform

This paper presents some results on fixed-point error analysis of the fast Hartley transform algorithms. A novel scheme for preventing overflow is considered in the analysis. It is proved that error performance, defined based on the signal-to-noise ratio, can be improved for both the decimation-in-frequency and the decimation-in-time fast Hartley transform algorithms. Zusammenfassung . Dieser A...

Comments on "fixed-point error analysis of fast Hartley transform"